Sum Complexes - a New Family of Hypertrees

نویسندگان

  • Nathan Linial
  • Roy Meshulam
  • M. Rosenthal
چکیده

A k-dimensional hypertree X is a k-dimensional complex on n vertices with a full (k−1)-dimensional skeleton and ( n−1 k ) facets such that Hk(X;Q) = 0. Here we introduce the following family of simplicial complexes. Let n, k be integers with k+1 and n relatively prime, and let A be a (k + 1)-element subset of the cyclic group Zn. The sum complex XA is the pure k-dimensional complex on the vertex set Zn whose facets are σ ⊂ Zn such that |σ| = k + 1 and ∑ x∈σ x ∈ A. It is shown that if n is prime then the complex XA is a k-hypertree for every choice of A. On the other hand, for n prime XA is k-collapsible iff A is an arithmetic progression in Zn.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chromatic Symmetric Functions of Hypertrees

The chromatic symmetric function XH of a hypergraph H is the sum of all monomials corresponding to proper colorings of H. When H is an ordinary graph, it is known that XH is positive in the fundamental quasisymmetric functions FS , but this is not the case for general hypergraphs. We exhibit a class of hypergraphs H — hypertrees with prime-sized edges — for which XH is F -positive, and give an ...

متن کامل

Prüfer codes for hypertrees

1: We describe a new Prüfer code which works also for infinite hypertrees.

متن کامل

Prüfer codes for acyclic hypertrees

We describe a new Prüfer code based on star-reductions which works for infinite acyclic hypertrees.

متن کامل

On The Spectra of Hypertrees ⋆

In this paper we study the spectral properties of a family of trees characterized by two main features: they are spanning subgraphs of the hypercube, and their vertices bear a high degree of (connectedness) hierarchy. Such structures are here called binary hypertrees and they can be recursively defined as the so-called hierarchical product of several complete graphs on two vertices. AMS classif...

متن کامل

Decorated hypertrees

C. Jensen, J. McCammond and J. Meier have used weighted hypertrees to compute the Euler characteristic of a subgroup of the automorphism group of a free product. Weighted hypertrees also appear in the study of the homology of the hypertree poset. We link them to decorated hypertrees after a general study on decorated hypertrees, which we enumerate using box trees.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 44  شماره 

صفحات  -

تاریخ انتشار 2010